Constructing sparse Davenport–Schinzel sequences
نویسندگان
چکیده
منابع مشابه
Constructing k-radius sequences
An n-ary k-radius sequence is a finite sequence of elements taken from an alphabet of size n such that any two distinct elements of the alphabet occur within distance k of each other somewhere in the sequence. These sequences were introduced by Jaromczyk and Lonc to model a caching strategy for computing certain functions on large data sets such as medical images. Let fk(n) be the shortest leng...
متن کاملConstructing Structure in Number Sequences
This paper reports on a design experiment in the domain of number sequences conducted in the course of the WebLabs project1. In this study, we designed and tested a set of activities in which 13-14 year old students use the ToonTalk programming environment to construct models of sequences and series, and then use the WebReports web-based collaboration system to share these models and their obse...
متن کاملConstructing Orthogonal de Bruijn Sequences
A (σ, k)-de Bruijn sequence is a minimum length string on an alphabet set of size σ which contains all σ k-mers exactly once. Motivated by an application in synthetic biology, we say a given collection of de Bruijn sequences are orthogonal if no two of them contain the same (k + 1)-mer; that is, the length of their longest common substring is k. In this paper, we show how to construct large col...
متن کاملConstructing Incremental Sequences in Graphs
Given a weighted graph G = (V,E,w), we investigate the problem of constructing a sequence of n = |V | subsets of vertices M1, . . . ,Mn (called groups) with small diameters, where the diameter of a group is calculated using distances in G. The constraint on these n groups is that they must be incremental: M1 ⊂ M2 ⊂ · · · ⊂ Mn = V . The cost of a sequence is the maximum ratio between the diamete...
متن کاملRisk bounds for sparse sequences
This version includes some results on Besov spaces at the end! 1 The single sequence problem Consider the estimation of a sequence of means μ = (μ1, μ2, . . . , μn) given independent observations Xi ∼ N(μi, 1). Define ŵ to be the marginal maximum likelihood estimator of the parameter w based on X1, X2, . . . , Xn, defined subject to the constraint that the corresponding threshold t̂ of the poste...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2020
ISSN: 0012-365X
DOI: 10.1016/j.disc.2020.111888